Kripke Models of Transfinite Provability Logic
نویسندگان
چکیده
For any ordinal Λ, we can define a polymodal logic GLPΛ, with a modality [ξ] for each ξ < Λ. These represent provability predicates of increasing strength. Although GLPΛ has no non-trivial Kripke frames, Ignatiev showed that indeed one can construct a universal Kripke frame for the variable-free fragment with natural number modalities, denoted GLPω. In this paper we show how to extend these constructions for arbitrary Λ. More generally, for each ordinals Θ,Λ we build a Kripke model IΛ and show that GLP 0 Λ is sound for this structure. In our notation, Ignatiev’s original model becomes I0 ω .
منابع مشابه
Bisimulation quotients of Veltman models
Interpretability logic is a modal description of the interpretability predicate. The modal system IL is an extension of the provability logic GL (Gödel–Löb). Bisimulation quotients and largest bisimulations have been well studied for Kripke models. We examine interpretability logic and consider how these results extend to Veltman models. REPORTS ON MATHEMATICAL LOGIC 40 (2006), 59–73 Domagoj VR...
متن کاملGeneralized Veltman models with a root
Provability logic is a nonstandard modal logic. Interpretability logic is an extension of provability logic. Generalized Veltman models are Kripke like semantics for interpretability logic. We consider generalized Veltman models with a root, i.e. r-validity, r-satisfiability and a consequence relation. We modify Fine’s and Rautenberg’s proof and prove non–compactness of interpretability logic.
متن کاملAnother extension of Basic Logic
Basic propositional logic was first introduced by Albert Visser in [6]. Basic logic is a proper subsystem of intuitionistic logic, and can be constructed from it by a weakening of modus ponens. This weakening allows for a larger collection of theories, for example formal provability logic. Formal provability logic is related to the provability modal logic GL just as intuitionistic logic is rela...
متن کاملKripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic [9, 5, 8]. This system plays an important role in some recent applications of provability algebras in proof theory [2, 3]. However, an obstacle in the study of GLP is that it is incomplete w.r.t. any class ...
متن کاملOn topological models of GLP
We develop topological semantics of a polymodal provability logic GLP. Our main result states that the bimodal fragment of GLP, although incomplete with respect to relational semantics, is topologically complete. The topological (in)completeness of GLP remains an interesting open problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012